2 00 8 Combinatorial representations of Coxeter groups over a field of two elements ∗

نویسندگان

  • Hau-wen Huang
  • Chih-wen Weng
چکیده

Let W denote a simply-laced Coxeter group with n generators. We construct an n-dimensional representation φ of W over the finite field F2 of two elements. The action of φ(W ) on F n 2 by left multiplication is corresponding to a combinatorial structure extracted and generalized from Vogan diagrams. In each case W of types A, D and E, we determine the orbits of F 2 under the action of φ(W ), and find that the kernel of φ is the center Z(W ) of W.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combinatorial representations of Coxeter groups over a field of two elements ∗

Let W denote a simply-laced Coxeter group with n generators. We construct an n-dimensional representation φ of W over the finite field F2 of two elements. The action of φ(W ) on Fn 2 by left multiplication is corresponding to a combinatorial structure extracted and generalized from Vogan diagrams. In each case W of types A, D and E, we determine the orbits of Fn 2 under the action of φ(W ), and...

متن کامل

2 00 7 Generalized Jones Traces and Kazhdan – Lusztig Bases

We develop some applications of certain algebraic and combinatorial conditions on the elements of Coxeter groups, such as elementary proofs of the pos-itivity of certain structure constants for the associated Kazhdan–Lusztig basis. We also explore some consequences of the existence of a Jones-type trace on the Hecke algebra of a Coxeter group, such as simple procedures for computing leading ter...

متن کامل

A combinatorial derivation of the Poincare' polynomials of the finite irreducible Coxeter groups

(1) The Poincar e polynomials of the nite irreducible Coxeter groups and the Poincar e series of the aane Coxeter groups on three generators are derived by an elementary combinatorial method avoiding the use of Lie theory and invariant theory. (2) Non-recursive methods for the computation of`standard reduced words' for (signed) permutations are described. The algebraic basis for both (1) and (2...

متن کامل

Posets from Admissible Coxeter Sequences

We study the equivalence relation on the set of acyclic orientations of an undirected graph Γ generated by source-to-sink conversions. These conversions arise in the contexts of admissible sequences in Coxeter theory, quiver representations, and asynchronous graph dynamical systems. To each equivalence class we associate a poset, characterize combinatorial properties of these posets, and in tur...

متن کامل

Groups with Two Extreme Character Degrees and their Minimal Faithful Representations

for a finite group G, we denote by p(G) the minimal degree of faithful permutation representations of G, and denote by c(G), the minimal degree of faithful representation of G by quasi-permutation matrices over the complex field C. In this paper we will assume that, G is a p-group of exponent p and class 2, where p is prime and cd(G) = {1, |G : Z(G)|^1/2}. Then we will s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008